Exact computation of the expectation curves of the bit-flip mutation using landscapes theory

Chicano, F., & Alba E. (2011). Exact computation of the expectation curves of the bit-flip mutation using landscapes theory. Proceedings of 13th Annual Genetic and Evolutionary Computation Conference, Dublin, Ireland, July 12-16, 2011. pp. 2027–2034.Bit-flip mutation is a common operation when a genetic algorithm is applied to solve a problem with binary representation. We use in this paper some results of landscapes theory and Krawtchouk polynomials to exactly compute the expected value of the fitness of a mutated solution. We prove that this expectation is a polynomial in p, the probability of flipping a single bit. We analyze these polynomials and propose some applications of the obtained theoretical results.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491-C04-01 (the M∗ project) and the Andalusian Government under contract P07-TIC-03044 (DIRICOM project)

Computing New Optimized Routes for GPS Navigators Using Evolutionary Algorithms

GPS navigators are now present in most vehicles and smartphones. The usual goal of these navigators is to take the user in less time or distance to a destination. However, the global use of navigators in a given city could lead to traffic jams as they have a highly biased preference for some streets. From a general point of view, spreading the traffic throughout the city could be a way of preventing jams and making a better use of public resources. We propose a way of calculating alternative routes to be assigned by these devices in order to foster a better use of the streets. Our experimentation involves maps from OpenStreetMap, real road traffic, and the microsimulator SUMO. We contribute to reducing travel times, greenhouse gas emissions, and fuel consumption. To analyze the sociological aspect of any innovation, we analyze the penetration (acceptance) rate which shows that our proposal is competitive even when just 10% of the drivers are using it.Spanish MINECO project TIN2014-57341-R (http://moveon.lcc.uma.es). FPU grant (FPU13/00954) from the Spanish Ministry of Education, Culture and Sports. University of Malaga. International Campus of Excellence Andalucia TECH

Red Swarm: Smart Mobility in Cities with EAs

This work presents an original approach to regulate traffic by using an on-line system controlled by an EA. Our proposal uses computational spots with WiFi connectivity located at traffic lights (the Red Swarm), which are used to suggest alternative individual routes to vehicles. An evolutionary algorithm is also proposed in order to find a configuration for the Red Swarm spots which reduces the travel time of the vehicles and also prevents traffic jams. We solve real scenarios in the city of Malaga (Spain), thus enriching the OpenStreetMap info by adding traffic lights, sensors, routes and vehicle flows. The result is then imported into the SUMO traffic simulator to be used as a method for calculating the fitness of solutions. Our results are competitive compared to the common solutions from experts in terms of travel and stop time, and also with respect to other similar proposals but with the added value of solving a real, big instance.Ministerio de Economía y Competitividad y FEDER (TIN2011-28194

Elementary Landscape Decomposition of the Test Suite Minimization Problem

Chicano, F., Ferrer J., & Alba E. (2011). Elementary Landscape Decomposition of the Test Suite Minimization Problem. In Proceedings of Search Based Software Engineering, Szeged, Hungary, September 10-12, 2011. pp. 48–63.Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscape called elementary landscape. The decomposition of the objective function of a problem into its elementary components provides additional knowledge on the problem that can be exploited to create new search methods for the problem. We analyze the Test Suite Minimization problem in Regression Testing from the point of view of landscape theory. We find the elementary landscape decomposition of the problem and propose a practical application of such decomposition for the search.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491- C04-01 (the M∗ project) and the Andalusian Government under contract P07- TIC-03044 (DIRICOM project)

Math Oracles: A New Way of Designing Efficient Self-Adaptive Algorithms

In this paper we present a new general methodology to develop self-adaptive methods at a low computational cost. Instead of going purely ad-hoc we de ne several simple steps to include theoretical models as additional information in our algorithm. Our idea is to incorporate the predictive information (future behavior) provided by well-known mathematical models or other prediction systems (the oracle) to build enhanced methods. We show the main steps which should be considered to include this new kind of information into any algorithm. In addition, we actually test the idea on a speci c algorithm, a genetic algorithm (GA). Experiments show that our proposal is able to obtain similar, or even better results when it is compared to the traditional algorithm. We also show the bene ts in terms of saving time and a lower complexity of parameter settings.Universidad de Málaga. Proyecto roadME (TIN2011-28194

Comparing metaheuristic algorithms for error detection in Java programs

Chicano, F., Ferreira M., & Alba E. (2011). Comparing Metaheuristic Algorithms for Error Detection in Java Programs. In Proceedings of Search Based Software Engineering, Szeged, Hungary, September 10-12, 2011. pp. 82–96.Model checking is a fully automatic technique for checking concurrent software properties in which the states of a concurrent system are explored in an explicit or implicit way. The main drawback of this technique is the high memory consumption, which limits the size of the programs that can be checked. In the last years, some researchers have focused on the application of guided non-complete stochastic techniques to the search of the state space of such concurrent programs. In this paper, we compare five metaheuristic algorithms for this problem. The algorithms are Simulated Annealing, Ant Colony Optimization, Particle Swarm Optimization and two variants of Genetic Algorithm. To the best of our knowledge, it is the first time that Simulated Annealing has been applied to the problem. We use in the comparison a benchmark composed of 17 Java concurrent programs. We also compare the results of these algorithms with the ones of deterministic algorithms.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491-C04-01 (the M∗ project) and the Andalusian Government under contract P07-TIC-03044 (DIRICOM project)

Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems

G. Luque, E. Alba, Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems, In Proceedings of Intelligent Networking and Collaborative Systems, pp. 184-191, 2-4 September, 2015, Taipei, Taiwan, IEEE PressThis paper proposes a novel algorithm combining path relinking with a set of cooperating trajectory based parallel algorithms to yield a new metaheuristic of enhanced search features. Algorithms based on the exploration of the neighborhood of a single solution, like simulated annealing (SA), have offered accurate results for a large number of real-world problems in the past. Because of their trajectory based nature, some advanced models such as the cooperative one are competitive in academic problems, but still show many limitations in addressing large scale instances. In addition, the field of parallel models for trajectory methods has not deeply been studied yet (at least in comparison with parallel population based models). In this work, we propose a new hybrid algorithm which improves cooperative single solution techniques by using path relinking, allowing both to reduce the global execution time and to improve the efficacy of the method. We applied here this new model using a large benchmark of instances of two real-world NP-hard problems: DNA fragment assembly and QAP problems, with competitive results.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Measuring the Quality of Machine Learning and Optimization Frameworks

Software frameworks are daily and extensively used in research, both for fundamental studies and applications. Researchers usually trust in the quality of these frameworks without any evidence that they are correctly build, indeed they could contain some defects that potentially could affect to thousands of already published and future papers. Considering the important role of these frameworks in the current state-of-the-art in research, their quality should be quantified to show the weaknesses and strengths of each software package. In this paper we study the main static quality properties, defined in the product quality model proposed by the ISO 25010 standard, of ten well-known frameworks. We provide a quality rating for each characteristic depending on the severity of the issues detected in the analysis. In addition, we propose an overall quality rating of 12 levels (ranging from A+ to D-) considering the ratings of all characteristics. As a result, we have data evidence to claim that the analysed frameworks are not in a good shape, because the best overall rating is just a C+ for Mahout framework, i.e., all packages need to go for a revision in the analysed features. Focusing on the characteristics individually, maintainability is by far the one which needs the biggest effort to fix the found defects. On the other hand, performance obtains the best average rating, a result which conforms to our expectations because frameworks’ authors used to take care about how fast their software runs.University of Malaga. Campus de Excelencia Internacional Andalucía Tech. We would like to say thank you to all authors of these frameworks that make research easier for all of us. This research has been partially funded by CELTIC C2017/2-2 in collaboration with companies EMERGYA and SECMOTIC with contracts #8.06/5.47.4997 and #8.06/5.47.4996. It has also been funded by the Spanish Ministry of Science and Innovation and /Junta de Andalucı́a/FEDER under contracts TIN2014-57341-R and TIN2017-88213-R, the network of smart cities CI-RTI (TIN2016-81766-REDT

Effective anytime algorithm for multiobjective combinatorial optimization problems

In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one. It is common that not all the efficient solutions can be computed in a short time and the search algorithm has to be stopped prematurely to analyze the solutions found so far. A set of efficient solutions that are well-spread in the objective space is preferred to provide the decision maker with a great variety of solutions. However, just a few exact algorithms in the literature exist with the ability to provide such a well-spread set of solutions at any moment: we call them anytime algorithms. We propose a new exact anytime algorithm for multiobjective combinatorial optimization combining three novel ideas to enhance the anytime behavior. We compare the proposed algorithm with those in the state-of-the-art for anytime multiobjective combinatorial optimization using a set of 480 instances from different well-known benchmarks and four different performance measures: the overall non-dominated vector generation ratio, the hypervolume, the general spread and the additive epsilon indicator. A comprehensive experimental study reveals that our proposal outperforms the previous algorithms in most of the instances.This research has been partially funded by the Spanish Ministry of Economy and Competitiveness (MINECO) and the European Regional Development Fund (FEDER) under contract TIN2017-88213-R (6city project), the European Research Council under contract H2020-ICT-2019-3 (TAILOR project), the University of Málaga, Consejería de Economía y Conocimiento de la Junta de Andalucía and FEDER under contract UMA18-FEDERJA-003 (PRECOG project), the Ministry of Science, Innovation and Universities and FEDER under contract RTC-2017-6714-5, and the University of Málaga under contract PPIT.UMA.B1.2017/07 (EXHAURO Project)

Enabling Low Cost Smart Road Traffic Sensing

Accurate traffic monitoring is a key aspect to develop Smart Mobility services. A road traffic monitoring system based on a network of sensors capturing together information from wireless interfaces of the devices inside the vehicles and also data about noise level is introduced here. This type of sensors obtain accurate road traffic flows and allow noise maps, that can be further analyzed to provide advanced services for mobility and pollution in the roads. Our main goal here is to develop such sensors at low cost with commodity devices, so as to boost their utilization.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech